Papyrus to PowerPoint (P 2 P): metamorphosis of scientific communication
نویسندگان
چکیده
منابع مشابه
Papyrus to PowerPoint (P 2 P): metamorphosis of scientific communication.
researchers used to visit libraries. More than half of online sessions end with a full text download, which is likely to look exactly like the article would in the paper journal. Users say they are interested in the added functionality of the web version, but even following links—which comes out top in users’ assessment of features—is a distinctly minority activity. Once users have downloaded w...
متن کاملP P 1 2
In the paper, we consider the problem of computing visibility information on digital terrain models. Visibility problems on polyhedral terrains are classi ed according to the kind of visibility information computed into point visibility, line visibility and region visibility. A survey of the state-of-the-art of the algorithms for computing visibility is presented, according to the classi cation...
متن کاملP Python for Scientific Computing
pressive syntax that some have compared to executable pseudocode. This might be part of the reason why I fell in love with the language in 1996, when I was seeking a way to prototype algorithms on very large data sets that overwhelmed the capabilities of the other interpreted computing environments I was familiar with. My enjoyment of programming with Python increased as I quickly learned to ex...
متن کاملQuery-to-Communication Lifting for P^NP
We prove that the PNP-type query complexity (alternatively, decision list width) of any boolean function f is quadratically related to the PNP-type communication complexity of a lifted version of f . As an application, we show that a certain “product” lower bound method of Impagliazzo and Williams (CCC 2010) fails to capture PNP communication complexity up to polynomial factors, which answers a...
متن کاملQuery-to-Communication Lifting for P
We prove that the P-type query complexity (alternatively, decision list width) of any boolean function f is quadratically related to the P-type communication complexity of a lifted version of f . As an application, we show that a certain “product” lower bound method of Impagliazzo and Williams (CCC 2010) fails to capture P communication complexity up to polynomial factors, which answers a quest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMJ
سال: 2002
ISSN: 0959-8138,1468-5833
DOI: 10.1136/bmj.325.7378.1478